Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

+(*(x, y), *(a, y)) → *(+(x, a), y)
*(*(x, y), z) → *(x, *(y, z))

Q is empty.


QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

+(*(x, y), *(a, y)) → *(+(x, a), y)
*(*(x, y), z) → *(x, *(y, z))

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:
a > +2 > *2

Status:
a: multiset
+2: [2,1]
*2: [1,2]